A New Precomputation Scheme for MPLS Traffic Engineering Routing

نویسندگان

  • Zhaowei Meng
  • Jinshu Su
  • Vittorio Manetti
چکیده

This paper presents a new precomputation algorithm for Multi Protocol Label Switching (MPLS) traffic engineering routing. The prior MPLS routing algorithms try to minimize the interference between different sourcedestination pairs by circumventing the critical links. But the process of identifying critical links is very computationally expensive. The main contribution of this paper is a new precomputation approach of route selection considering the interference. The proposed algorithm reduces online computing complexity through efficient precomputation. From the simulation results, the proposed algorithm outperforms prior algorithms in terms of efficiency and complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SDN-Based Resource Allocation in MPLS Networks: A Hybrid Approach

The highly dynamic nature of the current network traffics, makes the network managers to exploit the flexibility of the state-of-the-art paradigm called SDN. In this way, there has been an increasing interest in hybrid networks of SDN-MPLS. In this paper, a new traffic engineering architecture for SDN-MPLS network is proposed. To this end, OpenFlow-enabled switches are applied over the edge of ...

متن کامل

Repair strategies on the operation of MPLS routing

Efficient operation of multipath routing is considered as one of the important aspects in MPLS traffic engineering. Multipath routing has an advantage over the traffic routing based on single shortest path because single path routing may lead to unbalanced traffic situations and degraded QoS (Quality of Service). The adequate strategy for the order of repairing failed links can greatly influenc...

متن کامل

Supporting differentiated services with per-class traffic engineering in MPLS

Differentiated services (DiffServ) and MPLS are two major building blocks for providing multi-class services over IP networks. The performance and efficiency of Diierv architecture can be enhanced with per-class traffic engineering. In this paper, we propose a new MPLS traffic engineering scheme. Based on a constraint-based routing modified from our previously proposed QoS routing algorithm, it...

متن کامل

Edge router multicasting with MPLS traffic engineering

Explicit routing in MPLS is utilized in traffic engineering to maximize the operational network performance and to provide Quality of Service (QoS). However, difficulties arise while integrating native IP multicasting with MPLS traffic engineering, such as point-to-multipoint or multipoint-to-multipoint LSPs layout design and traffic aggregation. In this paper, we have proposed an edge router m...

متن کامل

Traffic Engineering with AIMD in MPLS Networks

We consider the problem of allocating bandwidth to competing flows in an MPLS network, subject to constraints on fairness, efficiency, and administrative complexity. The aggregate traffic between a source and a destination, called a flow, is mapped to label switched paths (LSPs) across the network. Each flow is assigned a preferred (‘primary’) LSP, but traffic may be sent to other (‘secondary’)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006